منابع مشابه
Ultimate Intelligence Part I: Physical Completeness and Objectivity of Induction
We argue that Solomonoff induction is universal and complete in the physical sense via several strong physical arguments. We argue that Solomonoff induction is fully applicable to quantum mechanics. We show how to choose an objective reference machine for universal induction by defining a physical message complexity for the presently considered ultimate intelligence research program. We introdu...
متن کاملassessment of the park- ang damage index for performance levels of rc moment resisting frames
چکیده هدف اصلی از طراحی لرزه ای تامین ایمنی جانی در هنگام وقوع زلزله و تعمیر پذیر بودن سازه خسارت دیده، پس از وقوع زلزله است. تجربه زلزله های اخیر نشان داده است که ساختمان های طراحی شده با آیین نامه های مبتنی بر نیرو از نظر محدود نمودن خسارت وارده بر سازه دقت لازم را ندارند. این امر سبب پیدایش نسل جدید آیین نامه های مبتنی بر عملکرد شده است. در این آیین نامه ها بر اساس تغییرشکل های غیرارتجاعی ...
15 صفحه اولReduced order model for doubly output induction generator in wind park using integral manifold theory
A dynamic reduced order model using integral manifold theory has been derived, which can be used to simulate the DOIG wind turbine using a double-winding representation of the generator rotor. The model is suitable for use in transient stability programs that can be used to investigate large power systems. The behavior of a wind farm and the network under various system disturbances was stu...
متن کاملCompleteness and quasi-completeness
The appropriate general completeness notion for topological vector spaces is quasi-completeness. There is a stronger general notion of completeness, which proves to be too strong in general. For example, the appendix shows that weak-star duals of infinite-dimensional Hilbert spaces are quasi-complete, but never complete in the stronger sense. Quasi-completeness for Fréchet spaces is ordinary me...
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00240-x